Approximation methods for complex polynomial optimization
نویسندگان
چکیده
منابع مشابه
Approximation methods for complex polynomial optimization
Complex polynomial optimization problems arise from real-life applications including radar code design, MIMO beamforming, and quantum mechanics. In this paper, we study complex polynomial optimization models whereby the objective function takes one of the following three forms: (1) multilinear; (2) homogeneous polynomial; (3) a conjugate symmetric form. On the constraint side, the decision vari...
متن کاملApproximation Methods for Inhomogeneous Polynomial Optimization
In this paper, we consider computational methods for optimizing a multivariate inhomogeneous polynomial function over a compact set. The focus is on the design and analysis of polynomial-time approximation algorithms. The references on approximation algorithms for inhomogeneous polynomial optimization problems are extremely scarce in the literature. To the best of our knowledge, the only result...
متن کاملOn Bernstein Type Inequalities for Complex Polynomial
In this paper, we establish some Bernstein type inequalities for the complex polynomial. Our results constitute generalizations and refinements of some well-known polynomial inequalities.
متن کاملApproximation Algorithms for Discrete Polynomial Optimization
In this paper, we consider approximation algorithms for optimizing a generic multivariate polynomial function in discrete (typically binary) variables. Such models have natural applications in graph theory, neural networks, error-correcting codes, among many others. In particular, we focus on three types of optimization models: (1) maximizing a homogeneous polynomial function in binary variable...
متن کاملPolynomial Optimization Methods for Matrix Factorization
Matrix factorization is a core technique in many machine learning problems, yet also presents a nonconvex and often difficult-to-optimize problem. In this paper we present an approach based upon polynomial optimization techniques that both improves the convergence time of matrix factorization algorithms and helps them escape from local optima. Our method is based on the realization that given a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Optimization and Applications
سال: 2014
ISSN: 0926-6003,1573-2894
DOI: 10.1007/s10589-014-9640-5